搜索资源列表
Huffmanencode
- 高效的huffman编解码，效率不错的哦-efficient Huffman encoding and decoding, oh, good efficiency
哈夫曼编译器
- 详细的哈夫曼编码、解码源程序，带有注释，分模块化-detailed Huffman encoding, decoding source, with Notes, modular -
Huffman.c2
- 1．在发送端通过一个编码系统对待传数据预先编码，在接收端将传来的数据进行译码（复原）。对于双工信道（即可以双向传输信息的通道），每端都需要一个完整的编/译 码系统。 2．本程序的目的是大大提高通信的信道利用率，缩短信息传输时间，降低传输成本。 -1. In the transmitter through a coding system for pre-treatment data-coding the receiving end of data from the decodin
huffman_cdoe
- 多个Huffman编码、解码器的程序，对数据结构的学习者很有用。-over Huffman encoding, decoding device procedures, data structures useful to learners.
dataS2
- 数据结构综合实验,有各种排序算法和计算排序时间,最短路径算法,huffman编码解码.用图形界面实现.在jbuilder2006下运行通过.-comprehensive experimental data structure, various sorting algorithm and sorting time, the shortest path algorithm, Huffman encoding and decoding. Using a graphical interface to a
实验5
- 哈夫曼编码/译码 背景介绍： 利用哈夫曼编码进行通信可以大大提高信道利用率，缩短信息传输时间，降低传输成本。但是，这要求这发送端通过一个编码系统对待传数据预先编码，在发送端将传来的数据进行译码（复原）。对于双工信道。每端都需要一个完整的编译码系统。本程序将为这样的信息收发站写一个哈夫曼的编译码系统。 哈夫曼编码/译码： 程序运行步骤： １、建立哈夫曼树，从键盘输入字符集大小，字符以及频度。 ２、对字符进行编码，输出编码结果，分单个句子和整个句子输出，编码导入
数据结构好冬冬
- 哈夫曼编码译码,克鲁斯卡尔算法,魔王语言的解释,一元稀疏多项式相乘，C-Huffman encoding decoding, Kelushikaer algorithm, fiendish language interpretation, one yuan sparse polynomial multiplication, C
haffumanshu
- 程序利用哈夫曼树进行哈夫曼的编码和译码，请大家指点。-procedures for the use of Huffman tree Huffman encoding and decoding, please guidance.
Huffman编码(二叉树应用)
- Huffman编码（二叉树的应用）其中包含了源代码及实验截图(Huffman encoding (Application of two fork tree) Which contains the source code and experimental screenshots)
huffman
- 一个简单的哈佛曼编码的程序没有什么太大的价值和意义。(A simple Harvard encoding program does not have much value or significance.)
Haffman
- 合理设计窗口界面，待编码的文字通过窗口的编辑界面（类似记事本的编辑界面）录入，在界面上显示各个字符出现的频率及哈夫曼编码，对原文编码并在界面上显示出来；对译码文字还原，显示在界面上与原文对照。功能菜单或按钮自行设计，以合理为目的。(Reasonable design of window interface, for encoding text through the window editing interface (Notepad edit interface) input, display
5、Huffman编码
- 哈夫曼编码(Huffman Coding)，又称霍夫曼编码，是一种编码方式，哈夫曼编码是可变字长编码(VLC)的一种。Huffman于1952年提出一种编码方法，该方法完全依据字符出现概率来构造异字头的平均长度最短的码字，有时称之为最佳编码，一般就叫做Huffman编码（有时也称为霍夫曼编码）。(Huffman encoding (Huffman Coding), also known as Hoffman encoding, is a coding method, and Huffman en
Huffman_GUI
- MATLAB霍夫曼Huffman编码译码GUI界面设计 源程序代码(MATLAB Hoffman Huffman encoding and decoding GUI interface design source code)
huffman
- 实现哈夫曼编码，要求对一个.txt文件(为测试方便，不允许有中文和全角字符出现)进行编码，生成一个只有0和1字符的编码文件。(The realization of Huffman encoding, requirements for a.Txt file (for convenient test, does not allow Chinese and full width characters) encoding, generating a only 0 and 1 character enco
test2
- 利用堆栈的形式对Huffman编码算法进行编程，编码过程还是比较高效的(Huffman encoding algorithm using the form of the stack programming, the encoding process is more efficient)
Huff
- 创建Huffman树以及进行Huffman编码打印Huffman树(Create a Huffman tree and print a Huffman tree with Huffman encoding)
huffman编码
- input The number of weights n (n>1) is first entered. Then the N weights are entered in turn (the weight is a positive integer greater than 0). output Corresponding to the input n weight value, the corresponding encoding is output in turn.
huffman
- Matlab program for Huffman encoding and decoding
Huffman
- Huffman coding is a lossless data compression algorithm. Huffman coding uses variable length code to represent a symbol of the source (eg a character in a file). The code is determined from an estimate of the probabilities of appearance of the source
Huffman
- Huffman coding is a lossless data compression algorithm. Huffman coding uses variable length code to represent a symbol of the source (eg a character in a file). The code is determined from an estimate of the probabilities of appearance of the source